Messy broadcasting — Decentralized broadcast schemes with limited knowledge
نویسندگان
چکیده
منابع مشابه
Average-Case "messy" Broadcasting
Current studies of “messy” broadcasting have so far concentrated on finding worst-case times. However, such worst-case scenarios are extremely unlikely to occur in general. Hence, determining average-case times or tight upper bounds for completing “messy” broadcasting in various network topologies is both necessary and meaningful in practice. In this paper, we focus on seeking the average-case ...
متن کاملDecentralized Dynamic Broadcast Encryption
A broadcast encryption system generally involves three kinds of entities: the group manager that deals with the membership, the encryptor that encrypts the data to the registered users according to a specific policy (the target set), and the users that decrypt the data if they are authorized by the policy. Public-key broadcast encryption can be seen as removing this special role of encryptor, b...
متن کاملSurvey on VOD Broadcasting Schemes
Warning: This survey article is still undergoing occasional revisions. Please make sure you read the latest verison. Original version = July 20, 2002; last update = April 2, 2005. Abstract— This paper discusses the principles underlying efficient video broadcasting and surveys a large number of recent papers written on the subject of video-on-demand (VOD), using consistent terminology and notat...
متن کاملBroadcast Enforced Threshold Schemes with Disenrollment
Blakley, Blakley, Chan and Massey conjectured a lower bound on the entropy of broadcast messages in threshold schemes with disenrollment. In an effort to examine the conjecture, we identify their original scheme definition has a limitation: a coalition of participants can reconstruct all shared secrets without broadcast from the dealer, and hence render the dealer no control over disenrollment....
متن کاملRate-optimal decentralized broadcasting: the wireless case
We consider the problem of broadcasting information from a source node to all nodes in a wireless network, using a local-control algorithm. For simplicity, we assume some oracle that provides the scheduling decisions required for interference. Under this assumption, we can show that a local control algorithm exists that achieves a stable system whenever the injection rate at the source is feasi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.12.002